#include<iostream>
#include<list>
#include<queue>


#include "priority_queue.h"
using namespace std;
int main()
{
	//dzp::priority_queue<int,vector<int>, greater<int>> a;
	dzp::priority_queue<int> a;
	a.push(1);
	a.push(6);
	a.push(5);
	a.push(100);
	a.push(7);
	a.push(15);
	a.push(2);

	while (!a.empty())
	{
		cout << a.top() << " ";
		a.pop();
	}
}
